Online Multicommodity Routing with Time Windows Tobias

We consider a multicommodity routing problem, where demands are released online and have to be routed in a network during specified time windows. The objective is to minimize a time and load dependent convex cost function of the aggregate arc flow. First, we study the fractional routing variant. We present two online algorithms, called Seq and Seq. Our first main result states that, for cost functions defined by polynomial price functions with nonnegative coefficients and maximum degree d, the competitive ratio of Seq and Seq is at most (d+1), which is tight. We also present lower bounds of (0.265 (d+ 1)) for any online algorithm. In the case of a network with two nodes and parallel arcs, we prove a lower bound of (2− 1 2 √ 3) on the competitive ratio for Seq and Seq, even for affine linear price functions. Furthermore, we study resource augmentation, where the online algorithm has to route less demand than the offline adversary. Second, we consider unsplittable routings. For this setting, we present two online algorithms, called U-Seq and U-Seq. We prove that for polynomial price functions with nonnegative coefficients and maximum degree d, the competitive ratio of U-Seq and U-Seq is bounded by O(1.77 d). We present lower bounds of (0.5307 (d + 1)) for any online algorithm and (d+ 1) for our algorithms. Third, we consider a special case of our framework: online load balancing in the `p-norm. For the fractional and unsplittable variant of this problem, we show that our online algorithms are p and O(p) competitive, respectively. Such results where previously known only for scheduling jobs on restricted (un)related parallel machines.